Asymptotically tight bounds on subset sums

نویسنده

  • Simon Griffiths
چکیده

For a subset A of a finite abelian group G we define Σ(A) = {∑a∈B a : B ⊂ A}. In the case that Σ(A) has trivial stabiliser, one may deduce that the size of Σ(A) is at least quadratic in |A|; the bound |Σ(A)| ≥ |A|2/64 has recently been obtained by De Vos, Goddyn, Mohar and Šámal [2]. We improve this bound to the asymptotically best possible result |Σ(A)| ≥ (1/4− o(1))|A|2. We also study a related problem in which A is any subset of Zn with all elements of A coprime to n; it has recently been shown, by Vu [6], that if such a set A has the property Σ(A) 6= Zn then |A| = O(√n). This bound was improved to |A| ≤ 8√n by De Vos, Goddyn, Mohar and Šámal [2], we further improve the bound to the asymptotically best possible result |A| ≤ (2 + o(1))√n.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Volumes of Nonnegative Polynomials, Sums of Squares and Powers of Linear Forms

We study the quantitative relationship between the cones of nonnegative polynomials, cones of sums of squares and cones of sums of powers of linear forms. We derive bounds on the volumes (raised to the power reciprocal to the ambient dimension) of compact sections of the three cones. We show that the bounds are asymptotically exact if the degree is fixed and number of variables tends to infinit...

متن کامل

Asymptotically tight bounds on the capacity and outage probability for QAM transmissions over Rayleigh-faded data channels with CSI

In this contribution, novel quickly computable analytical upper and lower bounds are presented on the symmetric capacity for flat-faded Rayleigh channels with finite-size quadrature amplitude modulation constellations when perfect channelstate information at the receiving site is available; the proposed bounds are asymptotically tight both for high and low signal-tonoise ratios. Furthermore, an...

متن کامل

Asymptotically tight bounds for some multicolored Ramsey numbers

Let H1,H2, . . . ,Hk+1 be a sequence of k + 1 finite, undirected, simple graphs. The (multicolored) Ramsey number r(H1,H2, . . . ,Hk+1) is the minimum integer r such that in every edge-coloring of the complete graph on r vertices by k + 1 colors, there is a monochromatic copy of Hi in color i for some 1 ≤ i ≤ k + 1. We describe a general technique that supplies tight lower bounds for several nu...

متن کامل

Inverse Theorems for Subset Sums

Let A be a nite set of integers. For h 1, let S h (A) denote the set of all sums of h distinct elements of A. Let S(A) denote the set of all nonempty sums of distinct elements of A. The direct problem for subset sums is to nd lower bounds for jS h (A)j and jS(A)j in terms of jAj. The inverse problem for subset sums is to determine the structure of the extremal sets A of integers for which jS h ...

متن کامل

Convex Forms That Are Not Sums of Squares

An orbitope is the convex hull of an orbit of a point under the action of a compact group. We derive bounds on volumes of sections of polar bodies of orbitopes, extending methods developed in [BB03]. As an application we realize the cone of convex forms as a section of the cone of nonnegative bi-homogeneous forms and estimate its volume. A convex form has to be nonnegative, but it has not been ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008